Benefits and Problems of using cycle-cutset within interative improvement algorithms
نویسنده
چکیده
Some experiments on randomly generated partial constraint satisfaction problems as well as an example from the domain of real world nurse rostering illustrate the advantage of the cyclecutset method as a repair step in iterative search. These results motivate the integration of adopted algorithms on solving tree-structured constraint problems and the cycle-cutset method into modern constraint-based optimization with branch-and-bound and propagation of global constraints.
منابع مشابه
A constraint programming approach to cutset problems
We consider the problem of finding a cutset in a directed graph G = (V, E), i.e. a set of vertices that cuts all cycles in G. Finding a cutset of minimum cardinality is NP-hard. There exist several approximate and exact algorithms, most of them using graph reduction techniques. In this paper we propose a constraint programming approach to cutset problems and design a global constraint for compu...
متن کاملAND/OR Cutset Conditioning
Cutset conditioning is one of the methods of solving reasoning tasks for graphical models, especially when space restrictions make inference (e.g., jointree-clustering) algorithms infeasible. The wcutset is a natural extention of the method to a hybrid algoritm that performs search on the conditioning variables and inference on the remaining problems of induced width bounded by w. This paper ta...
متن کاملOn Finding Minimal w-cutset
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subset of variables yields a subproblem of the reduced complexity where instantiated variables are removed. If the assigned variables constitute a cycle-cutset, the rest of the network is singly-connected and therefore can...
متن کاملOn finding minimal w-cutset problem
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that conditioning (assigning values) on a subset of variables yields a subproblem of the reduced complexity where instantiated variables are removed. If the assigned variables constitute a cycle-cutset, the rest of the network is singly-connected and therefore can be ...
متن کاملBPLS: Cutset-Driven Local Search For MPE and Improved Bounds for Minimal Cutsets in Grids
BPLS: Cutset-Driven Local Search For MPE and Improved Bounds for Minimal Cutsets in Grids by Alon Milchgrub Master of Science in Computer Science The problem of finding an optimum of a multivariate function described as a sum of potentials over (small) subsets of variables is one of fundamental interest both in probabilistic inference and other fields. In this thesis we present a cycle-cutset d...
متن کامل